GA-Based Heuristic Algorithms for QoS Based Multicast Routing
نویسندگان
چکیده
Computing the bandwidth-delay-constrained least-cost multicast routing tree is an NP-complete problem. In this paper, we propose a novel QoS-based multicast routing algorithm based on the genetic algorithms (GA). In the proposed algorithm, the connectivity matrix of edges is used for genotype representation. Some novel heuristics are also proposed for mutation, crossover, and creation of random individuals. We evaluate the performance and efficiency of the proposed GA-based algorithm in comparison with other existing heuristic and GA-based algorithms by the result of simulation. The proposed algorithm has overcome all of the previous algorithms in the literature. q 2003 Elsevier Science B.V. All rights reserved.
منابع مشابه
GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing
Computing the bandwidth-delay-constrained least-cost multicast routing tree is an NP-complete problem. In this paper, we propose a novel QoS-based multicast routing algorithm based on the genetic algorithms (GA). In the proposed method, the connectivity matrix of edges is used for genotype representation. Some novel heuristic algorithms are also proposed for mutation, crossover, and creation of...
متن کاملEfficient Multicast Routing with Multiple QoS Constraints Based on Genetic Algorithms
♣ This work was supported by ITRC under grant number T/500/4704 Abstract: The QoS-based multicast routing is an important issue in the next generation of high-speed multimedia networks. In this paper, we propose a novel QoS-based (multiple constraints) multicast routing algorithm based on the evolutionary algorithms. The connectivity matrix of edges encoding scheme is proposed for genotype repr...
متن کاملAn Efficient Evolutionary Algorithm for Multicast Routing with Multiple QoS Constraints
The bandwidth-delay-constrained least-cost multicast routing is a challenging problem in high-speed multimedia networks. Computing such a constrained Steiner tree is an NP-complete problem. In this paper, we propose a novel QoS-based multicast routing algorithm based on the genetic algorithms (GA). In the proposed method, the predecessors encoding is used for genotype representation. Some novel...
متن کاملA Heuristic Genetic Algorithm for Distributed Multicast Routing
Multicast (MC) routing algorithms capable of satisfying the quality of services(QoS) requirements of real-time applications will be essential for future high-speed networks. Genetic Algorithms (GA) are stochastic search optimisation methods used in combinatorial optimisation and parameter tuning applications. In this paper, a shared-tree routing protocol based on distributed Genetic Algorithms(...
متن کاملMulticast Routing with Multiple Constraints in High-Speed Networks Based on Genetic Algorithms
The bandwidth-delay-constrained least-cost multicast routing is a challenging problem in high-speed multimedia networks. Computing such a constrained Steiner tree is an NP-complete problem. In this paper, we propose a novel QoS-based multicast routing algorithm based on the genetic algorithms (GA). In the proposed method, the degree-based permutation encoding is used for genotype representation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Knowl.-Based Syst.
دوره 16 شماره
صفحات -
تاریخ انتشار 2003